Extended Branch Decomposition Graphs: Structural Comparison of Scalar Data
نویسندگان
چکیده
منابع مشابه
Extended Branch Decomposition Graphs: Structural Comparison of Scalar Data
We present a method to find repeating topological structures in scalar data sets. More precisely, we compare all subtrees of two merge trees against each other – in an efficient manner exploiting redundancy. This provides pair-wise distances between the topological structures defined by sub/superlevel sets, which can be exploited in several applications such as finding similar structures in the...
متن کاملScalar Product Graphs of Modules
Let R be a commutative ring with identity and M an R-module. The Scalar-Product Graph of M is defined as the graph GR(M) with the vertex set M and two distinct vertices x and y are adjacent if and only if there exist r or s belong to R such that x = ry or y = sx. In this paper , we discuss connectivity and planarity of these graphs and computing diameter and girth of GR(M). Also we show some of...
متن کاملComputing Branch Decomposition of Large Planar Graphs
A graph of small branchwidth admits efficient dynamic programming algorithms for many NP-hard problems on the graph. A key step in these algorithms is to find a branch decomposition of small width for the graph. Given a planar graph G of n vertices, an optimal branch decomposition of G can be computed in polynomial time, e.g., by the edge-contraction method in O(n) time. All known algorithms fo...
متن کاملStructural Learning of Chain Graphs via Decomposition.
Chain graphs present a broad class of graphical models for description of conditional independence structures, including both Markov networks and Bayesian networks as special cases. In this paper, we propose a computationally feasible method for the structural learning of chain graphs based on the idea of decomposing the learning problem into a set of smaller scale problems on its decomposed su...
متن کاملEmpirical Study on Branchwidth and Branch Decomposition of Planar Graphs
We propose efficient implementations of Seymour and Thomas algorithm which, given a planar graph and an integer β, decides whether the graph has the branchwidth at least β. The computational results of our implementations show that the branchwidth of a planar graph can be computed in a practical time and memory space for some instances of size about one hundred thousand edges. Previous studies ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Graphics Forum
سال: 2014
ISSN: 0167-7055
DOI: 10.1111/cgf.12360